Threshold Graph Limits and Random Threshold Graphs
نویسندگان
چکیده
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
منابع مشابه
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the web graph, where new nodes copy the link structure of existing nodes, and a certain number of additional random links are introduced. Our model parametrizes the number of random links, thereby allowing for the analysi...
متن کاملRandom Threshold Graphs
We introduce a pair of natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold graph G is generated by choosing n IID values x1, . . . , xn uniformly in [0, 1]; distinct vertices i, j of G are adjacent exactly when xi + x j > 1. We examine various properties of random threshold gra...
متن کاملHow to obtain sharp threshold functions for the random intersection graph via coupling method?
We will present a new method, which enables us to find threshold functions for many properties in random intersection graphs. This method will be used to establish sharp threshold functions in random intersection graphs for k–connectivity, perfect matching containment and Hamilton cycle containment. keywords: random intersection graph, threshold functions, connectivity, Hamilton cycle, perfect ...
متن کاملCombinatorial and Numerical Analysis of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographic threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. We show how the degree distribution, percolation and connectivity transitions, diamet...
متن کاملThreshold Phenomena in Random Graph Colouring and Satisfiability
Threshold Phenomena in Random Graph Colouring and Satisfiability Dimitris Achlioptas Doctor of Philosophy Graduate Department of Computer Science University of Toronto 1999 We study threshold phenomena pertaining to the colourability of random graphs and the satisfiability of random formulas. Consider a random graph G(n, p) on n vertices formed by including each of the (
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Internet mathematics
دوره 5 3 شماره
صفحات -
تاریخ انتشار 2008